Autoreducibility and Completeness for Partial Multivalued Functions
نویسندگان
چکیده
In this paper, we investigate a relationship between manyone-like autoreducibility and completeness for classes of functions computed by polynomial-time nondeterministic Turing transducers. We prove two results. One is that any many-one complete function for these classes is metric many-one autoreducible. The other is that any strict metric manyone complete function for these classes is strict metric many-one autoreducible. key words: partial multivalued function, autoreduction, many-one-like reduction
منابع مشابه
Fuzzy type theory with partial functions
This paper is a study of fuzzy type theory (FTT) with partial functions. Out of several possibilities we decided tointroduce a special value ”∗” that represents ”undefined”. In the interpretation of FTT, this value lays outside of thecorresponding domain. In the syntax it can be naturally represented by the description operator acting on the empty(fuzzy) set, because choosing an element from it...
متن کاملGeneralized multivalued $F$-contractions on non-complete metric spaces
In this paper, we explain a new generalized contractive condition for multivalued mappings and prove a fixed point theorem in metric spaces (not necessary complete) which extends some well-known results in the literature. Finally, as an application, we prove that a multivalued function satisfying a general linear functional inclusion admits a unique selection fulfilling the corresp...
متن کاملEigenfunction Expansions for Second-Order Boundary Value Problems with Separated Boundary Conditions
In this paper, we investigate some properties of eigenvalues and eigenfunctions of boundary value problems with separated boundary conditions. Also, we obtain formal series solutions for some partial differential equations associated with the second order differential equation, and study necessary and sufficient conditions for the negative and positive eigenvalues of the boundary value problem....
متن کاملAutoreducibility of NP-Complete Sets
We study the polynomial-time autoreducibility of NP-complete sets and obtain separations under strong hypotheses for NP. Assuming there is a p-generic set in NP, we show the following: • For every k ≥ 2, there is a k-T-complete set for NP that is k-T autoreducible, but is not k-tt autoreducible or (k − 1)-T autoreducible. • For every k ≥ 3, there is a k-tt-complete set for NP that is k-tt autor...
متن کاملA Strong Completeness Condition in Uniform Spaces with Well Ordered Bases
A natural strengthening of the completeness hypothesis, called B-completeness, allows us to extend to ωμ-metric spaces some properties of complete metric spaces which fail to hold if only the completeness condition is assumed. In this way we achieve some results on hyperspace theory, dealing with supercompleteness and with selections of multivalued functions. The notion of B-completeness is inv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Transactions
دوره 100-D شماره
صفحات -
تاریخ انتشار 2017